Ideal bases for graded polynomial rings and applications to interpolation
نویسنده
چکیده
Based on a generalized algorithm for the division with remainder of polynomials in several variables, a method for the construction of standard bases for polynomial ideals with respect to arbitrary grading structures is derived. In the case of ideals with finite codimension, which can be viewed upon as a polynomial interpolation problem, an explicit representation for the interpolation space of reduced polynomials can be given.
منابع مشابه
Quantum Drinfeld Hecke Algebras
We consider finite groups acting on quantum (or skew) polynomial rings. Deformations of the semidirect product of the quantum polynomial ring with the acting group extend symplectic reflection algebras and graded Hecke algebras to the quantum setting over a field of arbitrary characteristic. We give necessary and sufficient conditions for such algebras to satisfy a Poincaré-Birkhoff-Witt proper...
متن کاملNew Bases for Polynomial-Based Spaces
Since it is well-known that the Vandermonde matrix is ill-conditioned, while the interpolation itself is not unstable in function space, this paper surveys the choices of other new bases. These bases are data-dependent and are categorized into discretely l2-orthonormal and continuously L2-orthonormal bases. The first one construct a unitary Gramian matrix in the space l2(X) while the late...
متن کاملResults on Generalization of Burch’s Inequality and the Depth of Rees Algebra and Associated Graded Rings of an Ideal with Respect to a Cohen-Macaulay Module
Let be a local Cohen-Macaulay ring with infinite residue field, an Cohen - Macaulay module and an ideal of Consider and , respectively, the Rees Algebra and associated graded ring of , and denote by the analytic spread of Burch’s inequality says that and equality holds if is Cohen-Macaulay. Thus, in that case one can compute the depth of associated graded ring of as In this paper we ...
متن کاملComputational ideal theory in nitely generated extension rings
Since Buchberger introduced the theory of Gr obner bases in 1965 it has become an important tool in constructive algebra and, nowadays, Buchberger’s method is fundamental for many algorithms in the theory of polynomial ideals and algebraic geometry. Motivated by the results in polynomial rings a lot of possibilities to generalize the ideas to other types of rings have been investigated. The pe...
متن کاملSome Applications of Gröbner Bases in Robotics and Engineering
Gröbner bases in polynomial rings have numerous applications in geometry, applied mathematics, and engineering. We show a few applications of Gröbner bases in robotics, formulated in the language of Clifford algebras, and in engineering to the theory of curves, including Fermat and Bézier cubics, and interpolation functions used in finite element theory.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002